On Compact and Efficient Routing in Certain Graph Classes (Extended Abstract)
نویسندگان
چکیده
In this paper we refine the notion of tree-decomposition by introducing acyclic (R,D)-clustering, where clusters are subsets of vertices of a graph and R and D are the maximum radius and the maximum diameter of these subsets. We design a routing scheme for graphs admitting induced acyclic (R,D)-clustering where the induced radius and the induced diameter of each cluster are at most 2. We show that, by constructing a family of special spanning trees, one can achieve a routing scheme of deviation ∆ ≤ 2R with labels of size O(log n/ log log n) bits per vertex and O(1) routing protocol for these graphs. We investigate also some special graph classes admitting induced acyclic (R,D)-clustering with induced radius and diameter less than or equal to 2, namely, chordal bipartite, homogeneously orderable, and interval graphs. We achieve the deviation ∆ = 1 for interval graphs and ∆ = 2 for chordal bipartite and homogeneously orderable graphs.
منابع مشابه
On Compact and Efficient Routing in Certain Graph Classes
In this paper we refine the notion of tree-decomposition by introducing acyclic (R,D)-clustering, where clusters are subsets of vertices of a graph and R and D are the maximum radius and the maximum diameter of these subsets. We design a routing scheme for graphs admitting induced acyclic (R,D)-clustering where the induced radius and the induced diameter of each cluster are at most 2. We show t...
متن کاملA time-dependent vehicle routing problem for disaster response phase in multi-graph-based network
Logistics planning in disaster response phase involves dispatching commodities such as medical materials, personnel, food, etc. to affected areas as soon as possible to accelerate the relief operations. Since transportation vehicles in disaster situations can be considered as scarce resources, thus, the efficient usage of them is substantially important. In this study, we provide a dynamic vehi...
متن کاملGenerating an Indoor space routing graph using semantic-geometric method
The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...
متن کاملExact Distance Labelings Yield Additive-Stretch Compact Routing Schemes
Distance labelings and compact routing schemes have both been active areas of recent research. It was already known that graphs with constant-sized recursive separators, such as trees, outerplanar graphs, series-parallel graphs and graphs of bounded treewidth, support both exact distance labelings and optimal (additive stretch 0, multiplicative stretch 1) compact routing schemes, but there are ...
متن کامل